Entropy coded vector quantization with hidden Markov models
نویسندگان
چکیده
We propose a new vector quantization approach, which consists of Hidden Markov Models(HMMs) and entropy coding scheme. The entropy coding system is determined depending on the speech status modeled by HMMs, so the proposing approach can adaptively allocate suitable numbers of bits to the codewords. This approach realizes about 0.3[dB] coding gain in cepstrum distance(8 states HMMs). In other words, 8 bit-codebook is represented by about 6.5 bits for average code length. We also research for robustness to the channel error. HMMs and the entropy coding system, which seem to be weak to the channel error, are augmented to be robust, so that the in uence of the channel error is decreased into one-third.
منابع مشابه
Speech Coding and Recognition
This paper investigates the performance of a speech recognizer in an interactive voice response system for various coded speech signals, coded by using a vector quantization technique namely Multi Switched Split Vector Quantization Technique. The process of recognizing the coded output can be used in Voice banking application. The recognition technique used for the recognition of the coded spee...
متن کاملSpeech Coding & Recognition
This paper investigates the performance of a speech recognizer in an interactive voice response system for various coded speech signals, coded by using a vector quantization technique namely Multi Switched Split Vector Quantization Technique. The process of recognizing the coded output can be used in Voice banking application. The recognition technique used for the recognition of the coded spee...
متن کاملAlignment-Free Sequence Comparison with Vector Quantization and Hidden Markov Models
We introduce the concept of multiresolutions using vector quantization and hidden Markov models as a basis for alignment-free comparison of sequences. Different similarity measures can be discovered at different resolutions of the two sequences. The proposed approach provides a new aspect for studying the complexity of biological data and is effective for real-time processing.
متن کاملRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملVQ - EM - Training - CodebookVQ - EM - Testing - 6 ? BAUM
This paper presents a scheme of speaker-independent isolated word recognition in which Hidden Markov Modelling is used with Vector Quantization codebooks constructed using the Expectation-Maximization (EM) algorithm for Gaussian mixture models. In comparison with conventional vector quantization, the EM algorithm results in greater recognition accuracy.
متن کامل